Duality-Based Near-Fuel-Optimal Impulsive Trajectory Computation for Spacecraft Rendezvous Under Perturbations

نویسندگان

چکیده

In this study, a novel impulsive trajectory optimization algorithm for near-fuel-optimal rendezvous under perturbations is presented. The algorithm, called (AIRTOP), designed such that the accuracy of constraints improved as much possible while retaining first-order optimality, high-fidelity dynamics models encompass various orbital (e.g., nonspherical gravity, air drag, luni-solar and solar radiation pressure). To eliminate constraint errors, AIRTOP solves linearized problem recursively using nonsingular dual-primal algorithm. improve computational efficiency, applies approximate analytical gradient error norm during its elimination process. We present three numerical simulations near circular elliptical orbits. simulation results show i) can successfully solve problems realistic with minimal user intervention, ii) it generate more fuel-efficient solutions in similar or shorter computation time than two other methods, namely, differential corrector General Mission Analysis Tool global approach, which also take complex into account.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuel-Optimal Spacecraft Rendezvous with Hybrid On–Off Continuous and Impulsive Thrust

J = cost function N = number of impulses NLT = number of low-thrust-independent thrusters p = primer-vector magnitude p = primer vector pm = primer-vector absolute maximum r = relative position vector rj = space collocation of the jth impulse tf = final time tint = intermediate time tj = time instant of the jth impulse application tm = midcourse time corresponding to the primer absolute maximum...

متن کامل

Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO

The design of spacecraft trajectories for missions visiting multiple celestial bodies is here framed as a multi-objective bilevel optimization problem. A comparative study is performed to assess the performance of di↵erent Beam Search algorithms at tackling the combinatorial problem of finding the ideal sequence of bodies. Special focus is placed on the development of a new hybridization betwee...

متن کامل

Trajectory Control of Rendezvous with Maneuver Target Spacecraft

In this paper, a nonlinear trajectory control algorithm of rendezvous with maneuvering target spacecraft is presented. The disturbance forces on the chaser and target spacecraft and the thrust forces on the chaser spacecraft are considered in the analysis. The control algorithm developed in this paper uses the relative distance and relative velocity between the target and chaser spacecraft as t...

متن کامل

Using polynomial optimization to solve the fuel-optimal linear impulsive rendezvous problem

Nomenclature a = semi-major axis ; e = eccentricity ; ν = true anomaly ; φ(ν) = fundamental matrix of relative motion ; B(ν) = input matrix in the dynamic model of relative motion ; R(ν) = φ(ν)B(ν) = φ(ν)B(ν) = primer vector evolution matrix ; uf = φ(νf )Xf − φ(ν1)X1 6= 0 = boundary conditions ; N = number of velocity increments ; νi, ∀ i = 1, · · · , N = impulses application times ; ∆vi = impu...

متن کامل

Solving Fuel-optimal Impulsive Rendezvous Problem Using Primer Vector Theory and Real Algebraic Geometry

Abstract. In this paper, the optimal fuel impulsive time-fixed rendezvous problem is considered. Under some simplifying assumptions, this problem may be recast as a non convex polynomial optimization problem. A numerical solving algorithm using a convex relaxation based on sum-of-squares representation of positive polynomials is proposed. Numerical results are evaluated on two examples and chec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Guidance Control and Dynamics

سال: 2023

ISSN: ['1533-3884', '0731-5090']

DOI: https://doi.org/10.2514/1.g006601